Completeness of Partial Deduction for Coverability Problems of Petri Nets
نویسندگان
چکیده
In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. This paper characterises some classes of problems which can be decided by this approach. In particular, we show that a restricted form of partial deduction is already powerful enough to decide all coverability properties of Petri Nets. We also prove that two particular instances of partial deduction can be used to exactly compute the Karp-Miller tree as well as Finkel’s minimal coverability set. We thus establish a quite surprising link between algorithms for Petri nets and logic program specialisation.
منابع مشابه
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. It has also been shown that partial deduction is powerful enough to mimic certain algorithms to decide coverability properties of Petri nets. These algorithms are forward algorithms and hard to scale up to deal with more compli...
متن کاملReset nets between decidability
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separat...
متن کاملThe Complexity of Coverability in nu-Petri Nets
We show that the coverability problem in ν-Petri nets is complete for ‘double Ackermann’ time, thus closing an open complexity gap between an Ackermann lower bound and a hyper-Ackermann upper bound. The coverability problem captures the verification of safety properties in this nominal extension of Petri nets with name management and fresh name creation. Our completeness result establishes ν-Pe...
متن کاملMinimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm (K&M) unfolds the reachability graph of a Petri net and uses acceleration on branches to ensure termination. The MP algorithm improves the K&M algorithm by adding pruning between branches of the K&M tree. This idea was first introduced in the M...
متن کاملLogic Programming and Partial Deduction for the Verification of Reactive Systems: An Experimental Evaluation (Abstract of ongoing work)
In earlier work it has been shown that finite state CTL model checking of reactive systems can be achieved by a relatively simple interpreter written in tabled logic programming. This approach is flexible in the sense that various specification formalisms can be easily targeted (e.g., Petri nets, CSP, ...). Moreover, infinite state CTL model checking can be performed by analysing this interpret...
متن کامل